A GIS-based Dynamic Shortest Path Determination in Emergency Vehicles
نویسندگان
چکیده
Accomplishing an effective routing of emergency vehicle will minimize its response time and will thus improve the response performance. Traffic congestion is a critical problem in urban area that influences the travel time of vehicles. The aim of this study is developing a spatial decision support system (SDSS) for emergency vehicle routing. The proposed system is based on integration of geospatial information system (GIS) and real-time traffic conditions. In this system dynamic shortest path is used for emergency vehicle routing. This study investigates the dynamic shortest path algorithms and offers an applicable solution for emergency routing. The shortest path applied is based on Dijkstra algorithm in which specific rules have been used to intelligently update the proposed path during driving. Results of this study, illustrate that dynamic vehicle routing is an efficient solution for reduction of travel time in emergency routing. Finally, it is shown that using GIS in emergency routing offers a powerful capability for network analysis, visualization and management of urban traffic network. Spatial analysis capabilities of GIS are used to find the shortest or fastest route through a network. These capabilities of GIS for analyzing spatial networks enable them to be used as decision support systems (DSSs) for dispatching and routing of emergency vehicles.
منابع مشابه
Implementing 3d Network Analysis in 3d-gis
Way finding or routing has been always used by common people in navigating from one place (of origin) to another (destination). And most of them are in two dimensional routing or network. In orthogonal concept, two-dimensional (2D) or three-dimensional (3D) routing uses planar or non-planar graph and spatial extend, where the third dimension is used to calculate the weights for the edges in the...
متن کاملShortest Path Analysis Based on Dijkstra's Algorithm in Emergency Response System
In emergency situations, finding suitable routes to reach destination is critical issue. The shortest path problem is one of the well-known and practical problems in computer science, networking and other areas. This paper presents an overview on shortest path analysis for an effective emergency response mechanism to minimize hazardous events. Both graph theory and network analysis in GIS was d...
متن کاملALGORITHMS FOR BIOBJECTIVE SHORTEST PATH PROBLEMS IN FUZZY NETWORKS
We consider biobjective shortest path problems in networks with fuzzy arc lengths. Considering the available studies for single objective shortest path problems in fuzzy networks, using a distance function for comparison of fuzzy numbers, we propose three approaches for solving the biobjective prob- lems. The rst and second approaches are extensions of the labeling method to solve the sing...
متن کاملGIS-based Dynamic Traffic Congestion Modeling to Support Time-Critical Logistics
Time-critical logistics (TCL) refer to time-sensitive procurement, processing and distribution activities. A confounding factor is the transportation networks that contain these logistic systems. This paper reports on a GIS-based decision support system for dynamic congestion modeling and shortest path routing in TCL. The system predicts network flow at detailed temporal resolutions and solves ...
متن کاملIntelligent Traffic Management System for Prioritizing Emergency Vehicles in a Smart City (TECHNICAL NOTE)
Traffic congestion worldwide has led to loss of human lives due to failure in transporting accident victims, critical patients, medical equipment and medicines on time. With the unending growth in vehicular traffic everywhere, Internet of Things (IOT) and Vehicular Ad Hoc Network (VANET) have embarked as a promising platform for an Intelligent Traffic Management System (ITMS). Many researches h...
متن کامل